Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
نویسندگان
چکیده
منابع مشابه
Accurate polynomial root-finding methods for symmetric tridiagonal matrix eigenproblems
In this paper we consider the application of polynomial root-finding methods to the solution of the tridiagonal matrix eigenproblem. All considered solvers are based on evaluating the Newton correction. We show that the use of scaled three-term recurrence relations complemented with error free transformations yields some compensated schemes which significantly improve the accuracy of computed r...
متن کاملAccurate BABE Factorisation of Tridiagonal Matrices for Eigenproblems
Recently Fernando successfully resurrected a classical method for computing eigen vectors which goes back to the times of Cauchy This algorithm has been in the doldrums for nearly fty years because of a fundamental di culty highlighted by Wilkinson The algorithm is based on the solution of a nearly homogeneous system of equations J I z k ek zk for the approximate eigenvector z where is an eigen...
متن کاملAN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
متن کاملJacobi-Davidson Methods for Symmetric Eigenproblems
1 Why and how The Lanczos method is quite eeective if the desired eigenvalue is either max or min and if this eigenvalue is relatively well separated from the remaining spectrum, or when the method is applied with (A ? I) ?1 , for some reasonable guess for an eigenvalue. If none of these conditions is fulllled, for instance the computation of a vector (A ? I) ?1 y for given y may be computation...
متن کاملAutomatic Performance Tuning for the Multi-section with Multiple Eigenvalues Method for Symmetric Tridiagonal Eigenproblems
We propose multisection for the multiple eigenvalues (MME) method for determining the eigenvalues of symmetric tridiagonal matrices. We also propose a method using runtime optimization, and show how to optimize its performance by dynamically selecting the implementation parameters. Performance results using a Hitachi SR8000 supercomputer with eight processors per node yield (1) up to 6.3x speed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2016
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2016.06.009